The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Mathematics
• Graph coloring
• Combinatorial optimization
• Matching
• NP-complete problems
• Bipartite graph
• Union-closed sets conjecture
• Maximal independent set
• Triangle-free graph

(C) Springer Verlag, Lecture Notes on Computer Science Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs Takeaki UNO Department of Systems Science, Tokyo Institute of Technology,

Source URL: research.nii.ac.jp

Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood.

Source URL: www.ulb.ac.be

• Graph theory
• Bipartite graphs
• Geometric spanner
• Shortest path problem
• Planar graph
• Tree
• Delaunay triangulation
• NP-complete problems
• Planar separator theorem
• Trapezoid graph

Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs M ARCOS K IWI∗ M ARTIN L OEBL†

Source URL: iti.mff.cuni.cz

NEW CONSTRUCTIONS OF BIPARTITE GRAPHS ON m, n VERTICES, WITH MANY EDGES, AND WITHOUT SMALL CYCLES 1 F. LAZEBNIK

Source URL: www.math.udel.edu

BIPARTITE PARTIAL DUALS AND CIRCUITS IN MEDIAL GRAPHS STEPHEN HUGGETT∗ AND IAIN MOFFATT† arXiv:1106.4189v2 [math.CO] 24 FebAbstract. It is well known that a plane graph is Eulerian if and only if its geometric

Source URL: arxiv.org

Decompositions of Triangle-Dense Graphs∗ Rishi Gupta† Tim Roughgarden‡ C. Seshadhri

Source URL: theory.stanford.edu

• Graph theory
• Neighbourhood
• Clique
• Bipartite graph
• Planar graph
• Graph
• Treewidth
• Dense graph
• Triangle
• Graph operations
• Graph coloring
• Triangle-free graph

Edge Coloring and Decompositions of Weighted Graphs Uriel Feige∗and Mohit Singh† June 25, 2008 Abstract We consider two generalizations of the edge coloring problem in bipartite graphs. The

Source URL: www.wisdom.weizmann.ac.il

Fork-forests in bi-colored complete bipartite graphs Maria Axenovich∗, Marcus Krug†, Georg Osang‡, and Ignaz Rutter§ January 12, 2012 Abstract Motivated by the problem in [6], which studies the relative efficiency

Source URL: www.math.kit.edu

Algorithms – handout 3 Matchings April 28, 2014 Bipartite matchings are intersections of two matroids, but are not matroids themselves. We show how to find maximum cardinality matchings in bipartite graphs. The algori

Source URL: www.wisdom.weizmann.ac.il